An improved Hough transform voting scheme utilizing surround suppression

نویسندگان

  • Siyu Guo
  • Tony P. Pridmore
  • Yaguang Kong
  • Xufang Zhang
چکیده

The Hough transform has been a frequently used method for detecting lines in images. However, when applying Hough transform and derived algorithms using the standard Hough voting scheme on realworld images, the methods often suffer considerable degeneration in performance, especially in detection rate, because of the large amount of edges given by complex background or texture. It is very likely that these edges form false peaks in Hough space and thus produce false positives in the final results, or even suppress true peaks and cause missing lines. To reduce the impact of these texture region edges, a novel method utilizing surround suppression is proposed in this paper. By introducing a measure of isotropic surround suppression, the new algorithm treats edge pixels differently, giving small weights to edges in texture regions and large weights to edges on strong and clear boundaries, and uses these weights to accumulate votes in Hough space. In this way, false peaks formed by texture region edges are suppressed, and the quality of detection results is improved. An efficient computation method for calculating the isotropic surround suppression was also given, accelerating the proposed algorithm. Experimental results on a real-world image base show that the new method improves line detection rate significantly, compared with the standard Hough transform and the Hough transform using gradient direction information to guide the voting process. Though slower than the other two methods, the new algorithm can be preferable in applications where detection rate is of the most concern and where there is no very strict requirement for high speed performance. 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transformation Hashing: An Efficient Point Pattern Matching Scheme

Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as the largest common point set problem (LCP) under approximate congruence: given two point sets M and Q in R, and a tolerance parameter ǫ ≥ 0, the problem is to find a rigid motion μ such that the...

متن کامل

Fully Automatic Model Creation for Object Localization utilizing the Generalized Hough Transform

An approach for automatic object localization in medical images utilizing an extended version of the generalized Hough transform (GHT) is presented. In our approach the shape model in the GHT is equipped with specific model point weights, which are used in the voting process. The weights are adjusted in a discriminative training procedure, which aims at a minimal localization error of the GHT. ...

متن کامل

Iterative Hough Transform for Line Detection in 3D Point Clouds

The Hough transform is a voting scheme for locating geometric objects in point clouds. This paper describes its application for detecting lines in three dimensional point clouds. For parameter quantization, a recently proposed method for Hough parameter space regularization is used. The voting process is done in an iterative way by selecting the line with the most votes and removing the corresp...

متن کامل

A Method for Character String Extraction from Binary Images Using Hough Transform

This paper describes a method for extracting character strings which have various directions and sizes. In this method, we regard a character string as a line segment which width is equal to the character size, and extract the line segment (character string) using a robust line detection method, Hough Transform. The voting scheme of Hough transform is improved from black pixel-base to line segm...

متن کامل

Voting by Grouping Dependent Parts

Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however that mutually dependent local observations are independently voting for intrinsically global object properties such as object scale. All the votes are added up to obtain object hypotheses. The assumption is thus that obj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009